Fast Factorizations of Discrete Sine Transforms of Types Vi and Vii
نویسندگان
چکیده
Discrete Sine Transforms of types VI and VII (DST-VI/VII) have recently received considerable interest in video coding. In particular, it was shown that DST-VII offers good approximation for KLT of residual signals produced by spatial (Intra) prediction process. In this paper, we offer an additional argument for use of such transforms by showing that they allow fast computation. Specifically, we establish a mapping between N -point DST-VI/VII and an 2N + 1-point Discrete Fourier Transform (DFT), apply known factorization techniques for the DFT, and show how unused parts of the resulting flowgraph can be pruned, producing factorizations of DST-VI/VII.
منابع مشابه
Fast Computing of Discrete Cosine and Sine Transforms of Types VI and VII
The Discrete Sine and Cosine Transforms (DST and DCT) have already received considerable attention due to their use in source coding. The DCT of type-II (DCT-II) is at the core of standards for image and video compression, such as JPEG, H.26x-series, and MPEG 1-4 standards. The DST of type-I was suggested as a basis for Recursive Block Coding technique. The DCT and DST of type IV are used in de...
متن کاملDiscrete Cosine Transforms on Quantum Computers
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show that it is possible to realize the discrete cosine transforms and the discrete sine transforms of size N ...
متن کاملA Comrade-Matrix-Based Derivation of the Eight Versions of Fast Cosine and Sine Transforms
The paper provides a full self-contained derivation of fast algorithms to compute discrete Cosine and Sine transforms I IV. For the Sine I/II and Cosine I/II transforms a unified derivation based on the concept of the comrade matrix is presented. The comrade matrices associated with different versions of the transforms differ in only a few boundary elements; hence, in each case algorithms can b...
متن کاملDetection of Epilepsy Disorder by EEG Using Discrete Wavelet Transforms
IV ORGANISATION OF THESIS V TABLE OF CONTENTS VI-VII LIST OF FIGURES VIII-IX
متن کاملAutomatic generation of fast discrete signal transforms
This paper presents an algorithm that derives fast versions for a broad class of discrete signal transforms symbolically. The class includes but is not limited to the discrete Fourier and the discrete trigonometric transforms. This is achieved by finding fast sparse matrix factorizations for the matrix representations of these transforms. Unlike previous methods, the algorithm is entirely autom...
متن کامل